Multiple pattern matching: a Markov chain approach
نویسندگان
چکیده
منابع مشابه
Multiple pattern matching: a Markov chain approach.
RNA motifs typically consist of short, modular patterns that include base pairs formed within and between modules. Estimating the abundance of these patterns is of fundamental importance for assessing the statistical significance of matches in genomewide searches, and for predicting whether a given function has evolved many times in different species or arose from a single common ancestor. In t...
متن کاملTracking multiple extended objects - A Markov chain Monte Carlo approach
This paper proposes a multiple object tracking system for spatially extended objects, whose number is a priori not known and dynamically changing over time. Compared to the expected size of the objects, a high resolution range measuring sensor is used within an implementation of the proposed system. For that, the Bayesian framework is rigorously utilized and implemented using a reversible jump ...
متن کاملMultiple Pattern Matching Revisited
We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملMultiple-Pattern Matching Using Improved Bit-Parallel Approach
We consider a fundamental problem testing if every bit is zero in a bit vector in a so-called bit-parallel machine. In this machine, a machine word can have unlimited number of bits, and logical operations such as bitwise-and, bitwise-or, and so on, can be done in O(1) time. However, in each time, only one bit in a bit vector can be examined. We show how to solve this fundamental problem in O(1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Biology
سال: 2007
ISSN: 0303-6812,1432-1416
DOI: 10.1007/s00285-007-0109-3